A Data Hiding Scheme based on Voronoi Diagram

نویسندگان

  • Shi-Yu Cui
  • Zhi-Hui Wang
  • Chin-Chen Chang
  • Ming-Chu Li
چکیده

In this paper, we propose a novel image steganographic technique based on the Voronoi diagram. The basic idea is to generate a Voronoi diagram of a graph transformed from cover image; that is, the Voronoi points correspond to every two consecutive pixels in the cover image. According to the secret bits to be embedded, every Voronoi point will either be replaced by one of its neighbors or keep its original value. As a result, this scheme does not need any extra information, such as indicators, to extract the secret data. Furthermore, the experimental results show that the proposed scheme can achieve greater data hiding capacity with less distortion compared to related schemes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VAMSD: Voronoi Diagram Based Autonomous Mobile Sensor Deployment for Maximizing Coverage

This letter proposes a novel mobile sensor deployment scheme for maximizing coverage. The basic idea is to force mobile sensors to move to predetermined target points that are the optimal layout in a distributed manner using Voronoi diagram data structure. A simulation shows that the result of the proposed scheme is quite close to the optimal result and outperforms previous works. key words: mo...

متن کامل

Aiaa-2000-4919 Voronoi Diagram Based Cumulative Approximation for Engineering Optimization

This paper proposes a function approximation scheme based on Voronoi diagram, a technique of computational geometry, toward optimization cost saving in real engineering applications. The scheme consists of a blending function of local information over spatial structure among sample points that is topologically represented with Voronoi diagram, an estimation method of function gradients through ...

متن کامل

Interactive Analysis Using Voronoi Diagrams: Algorithms to Support Dynamic Update from a Generic Triangle-based Data Structure

This paper describes a series of dynamic update methods that can be applied to a family of Voronoi diagram types, so that changes can be updated incrementally, without the usual recourse to complete reconstruction of their underlying data structure. More efficient incremental update methods are described for the ordinary Voronoi diagram, the farthest-point Voronoi diagram, the order-k Voronoi d...

متن کامل

Key management in heterogeneous wireless sensor networks using Voronoi diagrams

Wireless sensor networks' nodes are divided to Hsensors and L-sensors. H-sensor nodes are more powerful than L-sensor nodes in term of processing and memory. Because of that H-sensors are considered as the cluster head and L-sensor as the cluster member. H-sensor is responsible for the security of this communication. Each node can communicate with neighbor nodes. Problems of the network are sec...

متن کامل

Voronoi cell nite di erence method for the di usion operator on arbitrary unstructured grids

Voronoi cells and the notion of natural neighbours are used to develop a nite di erence method for the di usion operator on arbitrary unstructured grids. Natural neighbours are based on the Voronoi diagram, which partitions space into closest-point regions. The Sibson and the Laplace (non-Sibsonian) interpolants which are based on natural neighbours have shown promise within a Galerkin framewor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012